Divide and Conquer, Faster: Speeding Up Molecular Simulations
نویسندگان
چکیده
منابع مشابه
The Divide - and - Conquer Subgoal - Ordering Algorithmfor Speeding up Logic
It is common to view programs as a combination of logic and control: the logic part deenes what the program must do, the control part { how to do it. The Logic Programming paradigm was developed with the intention of separating the logic from the control. Recently, extensive research has been conducted on automatic generation of control for logic programs. Only a few of these works considered t...
متن کاملThe Divide-and-Conquer Subgoal-Ordering Algorithm for Speeding up Logic Inference
It is common to view programs as a combination of logic and control: the logic part de nes what the program must do, the control part { how to do it. The Logic Programming paradigm was developed with the intention of separating the logic from the control. Recently, extensive research has been conducted on automatic generation of control for logic programs. Only a few of these works considered t...
متن کاملEfficient Divide-and-Conquer Simulations Of Symmetric FSAs
A finite-state automaton (FSA) is an abstract machine with finite working memory, whose input is a string from a finite alphabet, which reads the input one character at a time, and which has a deterministic transition function. An FSA is symmetric if its output is independent of the order in which the input symbols are read, i.e., if the output is invariant under permutations of the input. We s...
متن کاملDivide and Conquer
An instance of the given problem is divided into easier instances of the same problem, which are solved recursively and then combined to create a solution to the original instance. Of course, divide and conquer is not suitable for every problem. A divide and conquer approach will only work if the problem is easily divided into a small number of easier sub-problems, and the solution to the entir...
متن کاملDivide and (Iteratively) Conquer!
The Iterative Multi-Agent (IMA) Method works by breaking down a search problem into many sub-problems, each to be solved separately. Independent problem solving agents work on the sub-problems and use iteration to handle any interaction between the sub-problems. Each agent knows about a subset of the whole problem and cannot solve it all by itself. The agents, working in parallel, can use any m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Biophysical Journal
سال: 2015
ISSN: 0006-3495
DOI: 10.1016/j.bpj.2014.12.026